A Parallel Genetic Algorithm F Generation Expansion Plannin
نویسنده
چکیده
This paper presents an application of parallel genetic algorithm to optimal long-range generation expansion planning. The problem is formulated as a combinatorial optimization problem that determines the number of newly introduced generation units of each technology during different time intervals. A new string representation method for the problem is presented. Binary and decimal coding for the string representation method are compared. The method is implemented on transputers, one of the practical multi-processors. The effectiveness of the proposed method is demonstrated on a typical generation expansion problem with four technologies, five intervals, and a various number of generation units. It is compared favorably with dynamic programming and conventional genetic algorithm. The results reveal the speed and effectiveness of the proposed method for solving this problem.
منابع مشابه
Return on Investment in Transmission Network Expansion Planning Considering Wind Generation Uncertainties Applying Non-dominated Sorting Genetic Algorithm
Although significant private investment is absorbed in different sectors of power systems, transmission sector is still suffering from appropriate private investment. This is because of the pricing policies of transmission services, tariffs, and especially for investment risks. Investment risks are due to the uncertain behaviour of power systems that discourage investors to invest in the transm...
متن کاملOptimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm
Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...
متن کاملDistributed Generation Expansion Planning Considering Load Growth Uncertainty: A Novel Multi-Period Stochastic Model
Abstract – Distributed generation (DG) technology is known as an efficient solution for applying in distribution system planning (DSP) problems. Load growth uncertainty associated with distribution network is a significant source of uncertainty which highly affects optimal management of DGs. In order to handle this problem, a novel model is proposed in this paper based on DG solution, consideri...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملبرنامه ریزی توسعه تولید انرژی الکتریکی و جایابی نیروگاه برپایه الگوریتم ژنتیک ارتقا یافته و فرایند تحلیل سلسله مراتبی
This paper presents a new approach to solve generation expansion planning (GEP) problem by improved Genetic Algorithm (IGA). GEP is a large-scale stochastic highly constraint nonlinear discrete dynamic optimization problem. Generation system planers tend to use many different methods to address the expansion problem and to determine optimum plans by minimizing the mathematical objective functio...
متن کامل